New Descriptors of Textual Records: Getting Help from Frequent Itemsets
نویسندگان
چکیده
منابع مشابه
A New Algorithm for Mining Frequent Itemsets from Evidential Databases
Association rule mining (ARM) problem has been extensively tackled in the context of perfect data. However, real applications showed that data are often imperfect (incomplete and/or uncertain) which leads to the need of ARM algorithms that process imperfect databases. In this paper we propose a new algorithm for mining frequent itemsets from evidential databases. We introduce a new structure ca...
متن کاملA New Approach to Mine Frequent Itemsets
Mining frequent patterns in transaction databases and many other kinds of databases has been studied popularly in data mining research. Methods for efficient mining of frequent itemsets have been studied extensively by many researchers. However, the previously proposed methods still encounter some performance bottlenecks when mining databases with different data characteristics. The time requir...
متن کاملAxiomatization of frequent itemsets
Mining association rules is very popular in the data mining community. Most algorithms designed for finding association rules start with searching for frequent itemsets. Typically, in these algorithms, counting phases and pruning phases are interleaved. In the counting phase, partial information about the frequencies of selected itemsets is gathered. In the pruning phase as much as possible of ...
متن کاملMining Frequent Gradual Itemsets from Large Databases
Mining gradual rules plays a crucial role in many real world applications where huge volumes of complex numerical data must be handled, e.g., biological databases, survey databases, data streams or sensor readings. Gradual rules highlight complex order correlations of the form “The more/less X, then the more/less Y ”. Such rules have been studied since the early 70’s, mostly in the fuzzy logic ...
متن کاملMining maximal frequent itemsets from data streams
Frequent pattern mining from data streams is an active research topic in data mining. Existing research efforts often rely on a two-phase framework to discover frequent patterns: (1) using internal data structures to store meta-patterns obtained by scanning the stream data; and (2) re-mining the meta-patterns to finalize and output frequent patterns. The defectiveness of such a two-phase framew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Computer Science
سال: 2020
ISSN: 2196-8888,2196-8896
DOI: 10.1142/s2196888820500207